A Diagnostic Biomarker for Breast Cancer Screening <i>via</i> Hilbert Embedded Deep Low-Rank Matrix Approximation

نویسندگان

چکیده

Thermography has been used extensively as a complementary diagnostic tool in breast cancer detection. Among thermographic methods matrix factorization (MF) techniques show an unequivocal capability to detect thermal patterns corresponding vasodilation cases. One of the biggest challenges such is selecting best representation basis. In this study, embedding method proposed address problem and Deep-semi-nonnegative (Deep-SemiNMF) for thermography introduced, then tested 208 screening First, we apply Deep-SemiNMF infrared images extract low-rank representations each case. Then, embed bases obtain one basis patient. After that, 300 imaging features, called thermomics, decode information automatic model. We reduced dimensionality thermomics by spanning them onto Hilbert space using RBF kernel select three most efficient features block Schmidt Independence Criterion Lasso (block HSIC Lasso). The preserved heterogeneity successfully classified asymptomatic versus symptomatic patients applying random forest model (cross-validated accuracy 71.36% (69.42%-73.3%)).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Low-Rank Matrix Approximation

Matrix approximation is a common tool in recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model where we assume instead that the matrix is locally of low-rank, leading to a representation of the observed matrix as a weighted sum of low...

متن کامل

Schur method for low-rank matrix approximation

The usual way to compute a low-rank approximant of a matrix H is to take its truncated SVD. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε, we find all rank d approximants Ĥ such that H − Ĥ has 2-norm less than ε. The set o...

متن کامل

Low Rank Matrix Approximation for Geometry Filtering

Wepropose a robust, anisotropic normal estimationmethod for both point clouds and meshes using a low rank matrix approximation algorithm. First, we compute a local feature descriptor for each point and find similar, non-local neighbors that we organize into a matrix. We then show that a low rank matrix approximation algorithm can robustly estimate normals for both point clouds and meshes. Furth...

متن کامل

A Schur Method for Low-Rank Matrix Approximation

The usual way to compute a low-rank approximant of a matrix H is to take its singular value decomposition (SVD) and truncate it by setting the small singular values equal to 0. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε...

متن کامل

Low Rank Matrix Approximation in Linear Time

Given a matrix M with n rows and d columns, and fixed k and ε, we present an algorithm that in linear time (i.e., O(N)) computes a k-rank matrix B with approximation error ‖M−B‖2F ≤ (1+ ε)μopt(M, k), where N = nd is the input size, and μopt(M, k) is the minimum error of a k-rank approximation to M. This algorithm succeeds with constant probability, and to our knowledge it is the first linear-ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Instrumentation and Measurement

سال: 2021

ISSN: ['1557-9662', '0018-9456']

DOI: https://doi.org/10.1109/tim.2021.3085956